Regular Derivations in Basic Superposition on Constrained Clauses
نویسندگان
چکیده
We prove the completeness of the regular strategy of derivations for superposition-based calculi. The regular strategy was pioneered by Kanger in (Kan63), who proposed that all equality inferences take place before all other steps in the proof. We show that the strategy is complete with the redundancy notions of tautology elimination and subsumption. The implication of our result is the completeness of non-standard selection functions by which in clauses that contain both equality and relational literals, only the equality literals (and all of them) are selected.
منابع مشابه
Regular Derivations in Basic Superposition-Based Calculi
We prove the completeness of the regular strategy of derivations for superposition-based calculi. The regular strategy was pioneered by Kanger in [Kan63], who proposed that all equality inferences take place before all other steps in the proof. We show that the strategy is complete with the elimination of tautologies. The implication of our result is the completeness of non-standard selection f...
متن کاملTree dimension in verification of constrained Horn clauses
In this paper we show how the notion of tree dimension can be used in the verification of constrained Horn clauses (CHCs). The dimension of a tree is a numerical measure of its branching complexity and the concept here applies to Horn clause derivation trees. Derivation trees of dimension zero correspond to derivations using linear CHCs, while trees of higher dimension arise from derivations us...
متن کاملSaturation of First-Order (Constrained) Clauses with the Saturate System
1 Background During the last years, several saturation-based theorem proving techniques for full rst-order (ordering and/or equality constrained) clauses with equality have emerged. Bachmair and Ganzinger ((BG91]) apply a model construction technique for proving the refutational completeness of strict superposition (paramodulation restricted to maximal terms of maximal equations of clauses). Th...
متن کاملOn Arbitrary Selection Strategies for Basic Superposition
For first-order Horn clauses without equality, resolution is complete with an arbitrary selection of a single literal in each clause [dN 96]. Here we extend this result to the case of clauses with equality for superposition-based inference systems. Our result is a generalization of the result given in [BG 01]. We answer their question about the completeness of a superposition-based system for g...
متن کاملA Deductive-Complete Constrained Superposition Calculus for Ground Flat Equational Clauses
We describe an algorithm that generates prime implicates of equational clause sets without variables and function symbols. The procedure is based on constrained superposition rules, where constraints are used to store literals that are asserted as additional axioms (or hypotheses) during the proof search. This approach is sound and deductive-complete, and it is more e cient than previous algori...
متن کامل